Complete bipartite graph - PDFSEARCH.IO - Document Search Engine

Complete bipartite graph
Results: 71

#	Item
51	PHYSICAL REVIEW E 78, 016108 共2008兲 Biclique communities Sune Lehmann,1,2,3 Martin Schwartz,3,4 and Lars Kai Hansen3 1 Add to Reading List Source URL: www.barabasilab.com Language: English - Date: 2008-08-01 15:03:07 Clique Modularity Bipartite graph Complete bipartite graph Scale-free network Network analysis Power graph analysis Clique percolation method Graph theory Networks Community structure
52	Improved Quantum Query Complexity Bounds for Some Graph Problems Prafulla Dhariwal, Vinay Mayar Abstract We prove improved quantum query complexity bounds for some graph problem. Our results are based on a new quantum al Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:06 NP-complete problems Matching Combinatorial optimization Graph coloring Vertex cover Bipartite graph Adjacency matrix Independent set Shortest path problem Graph theory Mathematics Theoretical computer science
53	INFORMATION PROCESSING LETTERS Volume 11, number 2 A CORRWTION Add to Reading List Source URL: cs.anu.edu.au Language: English - Date: 2012-06-24 02:59:05 Complexity classes Morphisms Graph isomorphism NP-complete NP Matrix Bipartite graph Mathematics Theoretical computer science Graph theory
54	doi:[removed]j.jpdc[removed] Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-12-04 14:11:42 Graph partition Bipartite graph Constraint graph Graph Octahedron Fiduccia-Mattheyses algorithm Line graph of a hypergraph Graph theory NP-complete problems Hypergraph
55	Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP Marcus Bjareland? Peter Jonsson?? Dept. of Comp. and Info. Sci. Linkopings universitet Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-01-24 05:34:39 Constraint programming Graph coloring NP-complete problems Constraint satisfaction problem Bipartite graph Graph Complexity of constraint satisfaction Path decomposition Graph theory Mathematics Theoretical computer science
56	Matching is as Easy as Matrix Inversion Ketan Mulmuley ’ Computer Science Department University of California, Berkeley Umesh V. Vazirani 2 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2004-09-11 21:07:28 NP-complete problems Matching Clique problem Independent set Minimum spanning tree Computing the permanent Interval graph Factor-critical graph Bipartite graph Graph theory Mathematics Theoretical computer science
57	A BRANCH-AND-PRICE APPROACH FOR GRAPH MULTI-COLORING Anuj Mehrotra Department of Management Science School of Business Administration University of Miami Add to Reading List Source URL: mat.gsia.cmu.edu Language: English - Date: 2008-03-27 11:19:03 Graph coloring NP-complete problems Linear programming relaxation Independent set Linear programming Bipartite graph Fractional coloring Edge coloring Graph theory Mathematics Theoretical computer science
58	Perfect Graphs, Partitionable Graphs and Cutsets Michele Conforti Gerard Cornuejols y Grigor Gasparyan z and Kristina Vuskovic x Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2000-09-19 18:20:11 Line graph Clique Perfect graph Bipartite graph Matching NP-complete problems Combinatorial optimization Tree decomposition Graph structure theorem Graph theory Graph operations Chordal graph
59	Proving Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison May 30, 2009 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-12-31 10:44:44 Graph homomorphism Matching 2-satisfiability Bipartite graph Counting problem Constraint satisfaction problem Holographic algorithm Graph NP-complete Theoretical computer science Mathematics Graph theory

UPDATE